Randomized scheduling algorithm for virtual output queuing switch at the presence of non-uniform traffic
نویسندگان
چکیده
منابع مشابه
A Minimum Output Burstiness Traffic Scheduling Algorithm
In this paper, we present a traffic scheduling algorithm, called the Delay-Bound Monotonic with Average Rate Reservation (DM/ARR), which generates minimum output burstiness streams. We assume that connection i is policed by the leaky bucket algorithm with parameters (σi, ρi) where σi is the bucket size (or burstiness) and ρi is the leaky rate. Compared with the totally isolated scheme where con...
متن کاملScheduling VOQ Switches under Non-Uniform Traffic
Abstract — Input queueing is becoming increasingly important for high-bandwidth switches and routers. In previous work, we proved that it is possible to achieve 100% throughput for input-queued switches using a cell-by-cell scheduling algorithm called LQF. However, LQF is too complex to implement in hardware. In this paper we introduce a new algorithm called Longest Port First (LPF), which is d...
متن کاملFair and Smooth Scheduling for Virtual Output Queuing Switches Achieving 100% Throughput
Cell scheduling has received extensive attention. Most recent studies, however, focus on achieving a 100% switch throughput under the uniform arrivals. As the demand for quality of service increases, two important goals are to provide predictive cell latency and to reduce the output burstiness. This paper presents a new scheduling algorithm, Worst-case Iterative Longest Port First (WiLPF), whic...
متن کاملStable and Practical Scheduling Algorithms for High Speed Virtual Output Queuing Switches
High-performance input queued switches achieve good performance with low cost. However, with the appearance of optical techniques, the line rate is much higher than before. Scheduling algorithms require not only good performance in delay and stability but fast speed and simple implementation as well. A variety of scheduling algorithms for Virtual Output Queuing (VOQ) packet switch architecture ...
متن کاملA non-uniform traffic oriented scheduling algorithm in combined input-crosspoint-queued (CICQ) switches
Combined input-crosspoint-queued (CICQ) switch structure decouples the inputs and outputs matching and enables totally distributed arbitration. CICQ switch cannot achieve 100% throughput under nonuniform traffic if Round-Robin (RR-RR) algorithm is used. The other existing schemes require quite a bit of hardware and time complexity. In this paper, we theoretically prove that the RR-RR can achiev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Informatics and Communication Technology (IJ-ICT)
سال: 2019
ISSN: 2722-2616,2252-8776
DOI: 10.11591/ijict.v8i1.pp50-55